A Bootstrap Multigrid Eigensolver

نویسندگان

چکیده

This paper introduces bootstrap multigrid methods for solving eigenvalue problems arising from the discretization of partial differential equations. Inspired by full algebraic (BAMG) setup algorithm that includes an AMG eigensolver, it is illustrated how can be simplified case a discretized equation (PDE), thereby developing geometric (BMG) approach. We illustrate numerically efficacy BMG method for: (1) recovering eigenvalues having large multiplicity, (2) computing interior eigenvalues, and (3) approximating shifted indefinite problems. Numerical experiments are presented to basic components ideas behind success overall For completeness, we present error analysis two-grid Laplace-Beltrami problem.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Operator-based interpolation for bootstrap algebraic multigrid

Bootstrap Algebraic Multigrid (BAMG) is a multigrid-based solver for matrix equations of the form Ax = b. Its aim is to automatically determine the interpolation weights used in algebraic multigrid (AMG) by locally fitting a set of test vectors that have been relaxed as solutions to the corresponding homogeneous equation, Ax = 0, and are then possibly improved later using a multilevel eigensolv...

متن کامل

A generalized eigensolver based on smoothed aggregation (GES-SA) for initializing smoothed aggregation (SA) multigrid

Consider the linear system Ax = b, where A is a large, sparse, real, symmetric, and positive definite matrix and b is a known vector. Solving this system for unknown vector x using a smoothed aggregation multigrid (SA) algorithm requires a characterization of the algebraically smooth error, meaning error that is poorly attenuated by the algorithm’s relaxation process. For many common relaxation...

متن کامل

A Bootstrap Algebraic Multilevel Method for Markov Chains

This work concerns the development of an algebraic multilevel method for computing state vectors of Markov chains. We present an efficient bootstrap algebraic multigrid method for this task. In our proposed approach, we employ a multilevel eigensolver, with interpolation built using ideas based on compatible relaxation, algebraic distances, and least squares fitting of test vectors. Our adaptiv...

متن کامل

On a parallel Maxwell eigensolver

Fast domain decomposition solver for internal problems of 3D hierarchical hp-FEM I. Anoufriev, V. Korneev Deriving fast domain decomposition (DD) preconditioners-solvers for hp discretizations of 2-nd order elliptic equations is still a challenge [1], although one pioneering solver of this type has been recently presented in [2] and generalized on adaptive hp discretizations in [3]. As it is we...

متن کامل

Towards a Parallel Multilevel Preconditioned Maxwell Eigensolver

We report on a parallel implementation of the Jacobi–Davidson (JD) to compute a few eigenpairs of a large real symmetric generalized matrix eigenvalue problem

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: SIAM Journal on Matrix Analysis and Applications

سال: 2022

ISSN: ['1095-7162', '0895-4798']

DOI: https://doi.org/10.1137/20m131151x